MCTS Experiments on the Voronoi Game

نویسندگان

  • Bruno Bouzy
  • Marc Métivier
  • Damien Pellier
چکیده

Monte-Carlo Tree Search (MCTS) is a powerful tool in games with a finite branching factor. This paper describes an artificial player playing the Voronoi game, a game with an infinite branching factor. First, this paper shows how to use MCTS on a discretization of the Voronoi game, and the effects of enhancements such as RAVE and Gaussian processes (GP). A first set of experimental results shows that MCTS with UCB+RAVE or with UCB+GP are first good solutions for playing the Voronoi game without domain-dependent knowledge. Second, this paper shows how to greatly improve the playing level by using geometrical knowledge about Voronoi diagrams, the balance of diagrams being the key concept. The second set of experimental results shows that a player using MCTS and geometrical knowledge outperforms the player without knowledge.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

متن کامل

Game-Tree Properties and MCTS Performance

In recent years Monte-Carlo Tree Search (MCTS) has become a popular and effective search method in games, surpassing traditional αβ methods in many domains. The question of why MCTS does better in some domains than in others remains, however, relatively open. In here we identify some general properties that are encountered in game trees and measure how these properties affect the success of MCT...

متن کامل

Monte-Carlo Tree Search Solver

Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (LOA). A new MCTS variant, called MCTS-Solver, has been designed to play narrow tactical lines better in sudden-death games such as LOA. The variant differs from the traditional MCTS in respect to backpropagation and se...

متن کامل

Parallel Monte-Carlo tree search for HPC systems and its application to computer go

Monte-Carlo Tree Search (MCTS) is a class of simulation-based search algorithms. It brought about great success in the past few years regarding the evaluation of deterministic two-player games such as the Asian board game Go. A breakthrough was achieved in 2006, when Rémi Coulom placed 1st at the ICGA Computer Go Olympiad in Turin with his MCTS based Go programm CrazyStone in the 9× 9 devision....

متن کامل

Active Opening Book Application for Monte-Carlo Tree Search in 19×19 Go

The dominant approach for programs playing the Asian board game of Go is nowadays Monte-Carlo Tree Search (MCTS). However, MCTS does not perform well in the opening phase of the game, as the branching factor is high and consequences of moves can be far delayed. Human knowledge about Go openings is typically captured in joseki, local sequences of moves that are considered optimal for both player...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011